ACGA Algorithm of Solving Weapon - Target Assignment Problem

نویسندگان

  • Jiuyong Zhang
  • Chuanqing Xu
  • Xiaojing Wang
  • Dehui Yuan
چکیده

Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integration of genetic algorithm and ant colony algorithm then use ACGA algorithm to solve the Weapon-Target Assignment Problem. Calculations show that: when ACGA algorithm is used to solve Weapon – Target Assignment Problem, it has fast convergence and high accuracy. KeywordsWeapon -Target Assignment; ant colony algorithm; genetic algorithm; integration

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Genetic Algorithm with Domain Knowledge for Weapon-target Assignment Problems

In this paper, a novel genetic algorithm, including domain specific knowledge into the crossover operator and the local search mechanism for solving weapon-target assignment (WTA) problems is proposed. The WTA problem is a full assignment of weapons to hostile targets with the objective of minimizing the expected damage value to own-force assets. It is an NP-complete problem. In our study, a gr...

متن کامل

Hybrid Nested Partitions method with Intelligent Greedy Search for solving Weapon-Target Assignment Problem

The Weapon-Target Assignment (WTA) problem is one of the most important problems of military applications of operations research. The objective of the WTA problem is to find proper assignments of weapons to targets which minimize the expected damage of defensive side. The WTA problem is known to be NP-complete. In this paper, hybrid Nested Partitions (NP) method is proposed to solve WTA problem...

متن کامل

Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics

A general weapon-target assignment (WTA) problem is to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. Genetic algorithms (GAs) are widely used for solving complicated optimization problems, such as WTA problems. In this paper, a novel GA with greedy eugenics is proposed. Eugenics is a process of improving the quality of of...

متن کامل

The Weapon Target Assignment Strategy Research on Genetic Algorithm

The weapon target assignment is an important problem in modern air defense combat with multiobjects and fighters. The weapons units arrange is a dynamic and complex process, for saving weapons resources and attacking target effectively, the weapon target assignment model satisfies expected damage probability, the performance analysis such as target threat degree, the weapon attack priority and ...

متن کامل

A Neural Network — Based Optimization Algorithm for the Weapon-Target Assignment Problem

A neural network-based algorithm was developed for the Weapon-Target Assignment Problem (WTAP) in Ballistic Missile Defense (BMD). An optimal assignment policy is one which allocates targets to weapon platforms such that the total expected leakage value of targets surviving the defense is minimized. This involves the minimization of a non-linear objective function subject to inequality constrai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012